Static Corrective Controllers for Implementing Fault Tolerance in Asynchronous Sequential Circuits
نویسندگان
چکیده
منابع مشابه
Fsimac: a fault simulator for asynchronous sequential circuits
At very high frequencies, the major potential of asynchronous circuits is absence of clock skew and, through that, better exploitation of relative timing relations. This paper presents Fsimac, a gate-level fault simulator for stuck-at and gate-delay faults in asynchronous sequential circuits. Fsimac not only evaluates combinational logic and typical asynchronous gates such as Muller C-elements,...
متن کاملDefinite Asynchronous Sequential Circuits
An asynchronous unit delay is an n input n output of the input n-tuple prior to the last inlput change. It asynchronous sequential circuit in which the present value of the will then be shown that every asynchronous definite flow output n-tuple is equal to the value of the input n-tuple prior to the last input change. This paper considers the problem of determining ablecan brizeday a fee bac r ...
متن کاملFault - Tolerant Asynchronous Sequential
A general design technique for achieving single faulttolerant asynchronous sequential circuits is described. The design procedures apply over a large range of fault conditions and are extremely easy to use. Generally, less than three times the logic required for a single copy is needed to achieve single fault tolerance. In addition to fault tolerance, real time fault detection is easily achieve...
متن کاملTest Generation for Asynchronous Sequential Digital Circuits
The dissertation thesis is aimed at test generation for asynchronous sequential digital circuits, contributes to their timeand cost-effective testing, and indirectly supports their wider application, which improves the performance, the power consumption and the electromagnetic emission of future digital circuits. The main scientific contribution is design of the new test generator (optimized fo...
متن کاملFault Tolerance Bounds for Asynchronous Memory Consistency
A wait-free distributed algorithm is one in which every process can complete an operation in a finite number of steps. A generalization of wait-freedom is t-resilience, in which every process can complete an operation in a finite number of steps if no more than t processes fail (by stopping). We study the conditions under which algorithms that implement distributed shared memory (DSM) can be im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2016
ISSN: 1976-9172
DOI: 10.5391/jkiis.2016.26.2.135